A Proof of Freedom from Contradiction

A PROOF OF FREEDOM FROM CONTRADICTION By ALONZO

Negation and Proof by Contradiction in Access-Limited Logic

Access-Limited Logic (ALL) is a language for knowledge representation which formalizes the access limitations inherent in a network structured knowledge-base. Where a deductive method such as resolution would retrieve all assertions that satisfy a given pattern, an access-limited logic retrieves all assertions reachable by following an available access path. In this paper, we extend previous wo...

A simple proof of Zariski's Lemma

‎Our aim in this very short note is to show that the proof of the‎ ‎following well-known fundamental lemma of Zariski follows from an‎ ‎argument similar to the proof of the fact that the rational field‎ ‎$mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.

Towards a Thread-Local Proof Technique for Starvation Freedom

Today, numerous elaborate algorithms for the effective synchronization of concurrent processes operating on shared memory exist. Of particular importance for the verification of such concurrent algorithms are thread-local proof techniques, which allow to reason about the sequential program of one process individually. While thread-local verification of safety properties has received a lot of at...

from linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar

chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...